import java.util.Arrays;
import java.util.Random;

public class Test {

    public static void orderArray(int[] array){
        for (int i = 0; i < array.length; i++) {
            array[i] = i;
            //array[i] = array.length - i;
        }
    }

    public static void notOrderArray(int[] array){
        Random random = new Random();
        for (int i = 0; i < array.length; i++) {
            array[i] = random.nextInt(10_0000);
        }
    }

    private static void testInsertSort(int[] array) {
        array =Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.insertSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("直接插入排序耗时：" + (endTime - startTime));
    }

    private static void testShellSort(int[] array) {
        array =Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.shellSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("希尔排序耗时：" + (endTime - startTime));
    }

    private static void testSelectSort(int[] array) {
        array =Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.selectSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("选择排序耗时：" + (endTime - startTime));
    }

    private static void testHeapSort(int[] array) {
        array =Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.heapSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("堆排序耗时：" + (endTime - startTime));
    }

    private static void testBubbleSort(int[] array) {
        array =Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.bubbleSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("冒泡排序耗时：" + (endTime - startTime));
    }

    private static void testQuickSort(int[] array) {
        array =Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.bubbleSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("快速排序耗时：" + (endTime - startTime));
    }

    private static void testMergeSort(int[] array) {
        array =Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.bubbleSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("归并排序耗时：" + (endTime - startTime));
    }

    public static void main(String[] args) {
        testSimple();
        //testOther();
    }

    public static void testSimple(){
        int[] array = {10,6,7,1,3,9,4,2};
        System.out.println("排序前：" + Arrays.toString(array));
        Sort.countSort(array);
        System.out.println("排序后：" + Arrays.toString(array));

    }

    public static void testOther(){
        int[] array = new int[10_0000];
        orderArray(array);
        //notOrderArray(array);

        //testInsertSort(array);

        testShellSort(array);

        //testSelectSort(array);

        testHeapSort(array);

        testQuickSort(array);

        testMergeSort(array);
    }

}
